翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Gregory I. Piatetsky-Shapiro : ウィキペディア英語版
Gregory Piatetsky-Shapiro
Gregory I. Piatetsky-Shapiro (born 7 April 1958) is a data scientist, co-founder of KDD conferences and ACM SIGKDD association for Knowledge Discovery and Data Mining,〔 and President of (KDnuggets ), a leading site on Business Analytics, Data Mining, and Data Science. For simplicity, he usually abbreviates his name as Gregory Piatetsky.
==Early life==
Piatetsky was born to a Jewish-Russian family in Moscow, Russia. His father, Ilya Piatetski-Shapiro, was a well-known mathematician. He skipped 6th grade because of anti-semitic attacks and was admitted in 1970 to the Physics-Mathematics School N. 2 in Moscow.
In March 1974 Piatetsky emigrated to Israel with his mother, Inna. There, he studied mathematics at Tel-Aviv University, where at age 16 he was the youngest student. He also studied computer science for one semester at Technion, where he wrote a program in APL to play the game of Battleship. He was overwhelmingly defeated in the first game by his own program. That increased his interest in the nascent field of Machine Learning.
In 1977 Piatetsky received a full scholarship for graduate studies at NYU Courant Institute, where he received a MS (1979) and Ph.D. (1984). His first paper, published in SIGMOD in 1984, proved that secondary index selection is NP-complete by reducing it to set cover problem. However, in his dissertation he proved that the greedy method for set cover has a lower bound of 1 - 1/e ~ 63% of the optimal.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Gregory Piatetsky-Shapiro」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.